Structure Extraction from Presentation Slide Information

Abstract. Electronic presentations are used in numerous scenarios, such as lectures and meetings. In recent years, the widespread use of electronic presentations means that presentation slide data is increasing as one of industry’s most important information resources. Therefore, it is neces-sary to develop a practical usage method for the reutilisation of the data on slides. An approach to achieve this is to focus on visual structure information within a slide, because visual structure information is one of the most valuable, easy to understand methods for humans. However, since visual structure information is not explicitly defined in the slide data itself, computers have difficulty comprehending structure informa-tion directly. In this paper, we propose a method of extracting structure information from slide information. The proposed method is composed of two steps: organising objects within the slide as units, such as title, body text, figure and table, and structuring the units as a hierarchy tree based on a top-down approach

Extending inductive generalization with abduction

We proposes an integrated framework of inductive generalization and abductive reasoning. In this framework, inductive hypotheses can be generated even if the background knowledge is not sufficient to generate hypotheses in an usual manner. The main issue of inductive generalization is to construct definitions of given examples when examples and relevant background knowledge are given. While most inductive generalization systems presuppose that the background knowledge is enough to induce definitions of given examples, the assumption is not usually met in real-world situation. In order to overcome this difficulty, we propose a framework of inductive generalization extended with abductive reasoning. This approach uses abduction when inductive generalization needs more items of background knowledge. Our approach is an integration of Inductive Logic programming and Abductive Logic Programming.リサーチレポート（北陸先端科学技術大学院大学情報科学研究科

Development and Practice of Programming Learning Course Management System with Version Control Software

We have developed “SVNLecture,” a programming course management system based on a version control software subversion. SVNLecture is a Web-based system for the management of programming courses. SVNLecture assists the teachers to create SVN repositories for their course and to manage student access permissions for the repositories. We also developed a special SVN client “SVN4Lec” for novices who have limiter computer skills. SVN4Lec provides basic functions such as checkout/update and commit with simple GUI. Therefore, SVN4Lec reduces the burdens of the students with regard to the downloading, deploying, and submitting of their files. We applied SVNLecture and SVN4Lec for a C# programming course for novice learners and determined its effectiveness in practice.The original publication is available at JAIST Press http://www.jaist.ac.jp/library/jaist-press/index.htmlKICSS 2007 : The Second International Conference on Knowledge, Information and Creativity Support Systems : PROCEEDINGS OF THE CONFERENCE, November 5-7, 2007, [Ishikawa High-Tech Conference Center, Nomi, Ishikawa, JAPAN

A consensus making support system using AHP in combination with KJ method and relationship matrix

We propose a computer assisted method of consensus making for cooperative group decision problem solving. The problem solving has a process which constructs appropriate evaluation structure interactively and chooses the optimal alternative plan rationally. However, in this problem solving, the problem is usually complicated because it contains some ill-structured elements and each participant in the group has his own sense of value which is different from the others. Additionally, both subjective and objective evaluations are often needed in order to solve the problem. These make the problem solving more complexed. Our major concern is to support the problem solving rationally by using distributed computer systems. We expect the problem can be solved effectively by integrating various techniques of creative thinking support, system engineering, group decision support and groupware. This paper describes a consensus making support method which uses AHP in combination with a creative thinking method and a relationship matrix associating subjective evaluation with objective evaluation. The implementation example is also given.リサーチレポート（北陸先端科学技術大学院大学情報科学研究科

Consensus-making Support Systems dedicated to Creative Problem Solving

There are many creative thinking manual methods in the world. They are brain-storming method, brain-writing method, mind mapping, NM method, Equivalent Transformation method, KJ method, etc. Human thinking process for creative problem solving consists of 4 sub-processes. They are divergent thinking sub-process, convergent thinking sub-process, idea crystallization sub-process, and idea verification sub-process. In accordance with this proposal, most Japanese research and development is centered on this four types of creative thinking manual methods and support systems. In this paper, we describe three types of Group Decision Support Systems (DSSs) for creative problem solving, similar to KJ method. All design philosophy depends on bottom-up decision-making. They are knowledge acquisition support groupware GRAPE, consensus-making support systems Group Coordinator (I) and Group Coordinator (II). The characteristic function of GRAPE is knowledge merging for GRAPE users, and that of Group-Coordinator (I) and Group-Coordinator (II) is tradeoff resolution by sensitivity analysis and adjusting of user requirements by the QDA method, respectively. The systems that we have developed are similar to the KJ method, which is the most popular methodology for creative problem solving in Japan. The essence of our developed methodology and tools is that it boosts intellectual productivity. GRAPE and its successors can speed-up the given group decision making problem by two to three times with respect to the idea crystallization (evaluation and judgment) sub-process

Kunifuji: A Tabletop Interface Using Controllable Transparency Glass for Collaborative Card-based Creative Activity

Abstract. Conventional tabletop systems have focused on communication with virtual data, using phicons or physical objects as handles. This approach is versatile, given the full use of a horizontal display. However, we consider that an another approach can be formulated that can support normal specific tasks on a table. We have developed a card-handling activity environment enhanced by a tabletop interface. We use a glass tabletop with controllable transparency to improve surface scanning and the display of supplemental data. We describe the architecture of the tabletop system and its design criteria. Due to its simple configuration, this tabletop system can handle a large number of paper cards, as used in the KJ method. Therefore, our system can be used to enhance cardbased tasks by showing additional data, and it provides the ability to review transactions by recording the tasks

CONSENSUS-MAKING SUPPORT SYSTEMS DEDICATED TO CREATIVE PROBLEM SOLVING

There are many creative thinking manual methods in the world. They are brainstorming method, brain-writing method, mind mapping, NM method, Equivalent Transformation method, KJ method, etc. Human thinking process for creative problem solving consists of four sub-processes. They are divergent thinking sub-process, convergent thinking sub-process, idea crystallization sub-process, and idea verification sub-process. In accordance with this proposal, most Japanese research and development is centered on this four types of creative thinking manual methods and support systems. In this paper, we describe three types of Group Decision Support Systems (DSSs) for creative problem solving, similar to KJ method. All design philosophy depends on bottom-up decision-making. They are knowledge acquisition support groupware GRAPE, consensus-making support systems Group Coordinator (I) and Group Coordinator (II). The characteristic function of GRAPE is knowledge merging for GRAPE users, and that of Group-Coordinator (I) and Group-Coordinator (II) is tradeoff resolution by sensitivity analysis and adjusting of user requirements by the QDA method, respectively. The systems that we have developed are similar to the KJ method, which is the most popular methodology for creative problem solving in Japan. The essence of our developed methodology and tools is that it boosts intellectual productivity. GRAPE and its successors can speed-up the given group decision making problem by two to three times with respect to the idea crystallization (evaluation and judgment) sub-process.Creativity support system, decision-making support system, bottom-up decision-making, KJ method, AHP

GKJ: Group KJ Method Support System Utilizing Digital Pens

Practitioners of the Jiro Kawakita (KJ) method, a method for organizing ideas, typically use paper labels and four-colored ball-point pens to record their ideas during the creative thinking process. A similar approach is used in group KJ method sessions; however, the effectiveness of capturing and sharing the diagrams and information is limited because of the large amount of paper required. Considering the merits of the conventional paper-pen approach and the demand for quick sharing of diagrams after a session, we designed and implemented a system to digitize group KJ sessions — not just the diagrams but also the details of the creative process. We used digital pens during the session to capture the position and orientation of labels as well as their content. We confirmed the efficiency of our system by applying it to several GKJ sessions

Asynchronous Island Parallel GA Using Multiform Subpopulations

. Island Parallel GA divides a population into subpopulations and assigns them to processing elements on a parallel computer. Then each subpopulation searches the optimal solution independently, and exchanges individuals periodically. This exchange operation is called migration. In this research, we propose a new algorithm that migrants are exchanged asynchronously among multiform subpopulations which have different search conditions. The effect of our algorithm on combinational optimization problems was verified by applying the algorithm to Knapsack Problem and Royal Road Functions using parallel computer CRAY-T3E. We obtained the results that our algorithm maintained the population's diversity effectively and searches building blocks efficiently. 1 Introduction There are two typical problems in Genetic Algorithms (GAs). First, GAs require huge calculation time for their genetic operations, such as selection, crossover, mutation, and individuals' fitness evaluations. Secondly, mainten..